An involution on bicubic maps and β(0, 1)-trees
نویسندگان
چکیده
Bicubic maps are in bijection with β(0, 1)-trees. We introduce two new ways of decomposing β(0, 1)-trees. Using this we define an endofunction on β(0, 1)-trees, and thus also on bicubic maps. We show that this endofunction is in fact an involution. As a consequence we are able to prove some surprising results regarding the joint equidistribution of certain pairs of statistics on trees and maps. Finally, we conjecture the number of fixed points of the involution.
منابع مشابه
Stack Sorting, Trees, and Pattern Avoidance
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice through a stack (where the letters on the stack have to be in increasing order) was conjectured by West, and later proved by Zeilberger. Goulden and West found a...
متن کاملDecompositions and Statistics for Β(1, 0)-trees and Nonseparable Permutations
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice through a stack (where the letters on the stack have to be in increasing order) was conjectured by West, and later proved by Zeilberger. Goulden and West found a...
متن کاملGray coding cubic planar maps
The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize β-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps.
متن کاملGray coding planar maps
The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize β-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps.
متن کاملJa n 20 05 Combinatorics of bicubic maps with hard particles
We present a purely combinatorial solution of the problem of enumerating pla-nar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting of the maps. Although these trees have no simple local characterization, we prove that their enumeration may be performed upon introducing a larger class o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 61 شماره
صفحات -
تاریخ انتشار 2015